About Random Bits
نویسندگان
چکیده
1 Random Bit Generators 2 1.1 Pseudo-Random Bit Generators . . . . . . . . . . . . . . . . . . . . 2 2 Physical Sources for Random Bits 3 2.1 Exploiting Air Turbulence in Hard Disk Drives . . . . . . . . . . 3 2.2 Generating Unbiased Random Bits . . . . . . . . . . . . . . . . . . 4 3 Generating Random Seeds 5 3.1 Obtaining Random Timings . . . . . . . . . . . . . . . . . . . . . . 6 3.2 Locating Good Offsets . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.3 Estimating the Bias . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.4 Harvesting the Entropy . . . . . . . . . . . . . . . . . . . . . . . . . 8 4 Boosting Randomness 8 4.1 The Blum Blum Shub Algorithm . . . . . . . . . . . . . . . . . . . 8 4.2 Improvements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 5 Statistical Tests 12 5.1 The Diehard Test-Suite . . . . . . . . . . . . . . . . . . . . . . . . . 13 6 Conclusion 14 A An Introduction to Hard Disk Drives 15 B Auxiliary Definitions 15
منابع مشابه
Designing a Side Channel Resistant Random Number Generator
This paper describes the design of the random number generator (RNG) in the Caernarvon high assurance smart card operating system. Since it is used in the generation of cryptographic keys and other sensitive materials, the RNG has a number of stringent security requirements that the random bits must be of good quality i.e. the bits must not be predictable or biased. To this end, a number of sta...
متن کاملAn Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for this function. We consider a special case of this problem, the discrete logarithm with short exponents, which is also believed to be hard to compute. Under this intractibility assumption we show that discrete exponent...
متن کاملHardware Implementation of Dynamic S-BOX to Use in AES Cryptosystem
One of the major cipher symmetric algorithms is AES. Its main feature is to use S-BOX step, which is the only non-linear part of this standard possessing fixed structure. During the previous studies, it was shown that AES standard security was increased by changing the design concepts of S-BOX and production of dynamic S-BOX. In this paper, a change of AES standard security is studied by produc...
متن کاملGeneric Attacks on Alternating Unbalanced Feistel Schemes
Generic attacks against classical (balanced) Feistel schemes, unbalanced Feistel schemes with contracting functions and unbalanced Feistel schemes with expanding functions have been studied in [12], [4], [15], [16]. In this paper we study schemes where we use alternatively contracting random functions and expanding random functions. We name these schemes “Alternating Unbalanced Feistel Schemes”...
متن کاملE cient Privatization of Random Bits
The paper investigates the extent to which a public source of random bits can be used to obtain private random bits that can be safely used in cryptographic protocols This process is called privatization of random bits We consider the case in which the party privatizing random bits has a small number of private random bits Using techniques from the theory of pseudo random generators and nely ta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004